Level workforce planning for multistage transfer lines

In this article, we define two different workforce leveling objectives for serial transfer lines. Each job is to be processed on each transfer station for c time periods (e.g., hours). We assume that the number of workers needed to complete each operation of a job in precisely c periods is given. Jobs transfer forward synchronously after every production cycle (i.e., c periods). We study two leveling objectives: maximin workforce size () and min range (R). Leveling objectives produce schedules where the cumulative number of workers needed in all stations of a transfer line does not experience dramatic changes from one production cycle to the next. For and a two‐station system, we develop a fast polynomial algorithm. The range problem is known to be NP‐complete. For the two‐station system, we develop a very fast optimal algorithm that uses a tight lower bound and an efficient procedure for finding complementary Hamiltonian cycles in bipartite graphs. Via a computational experiment, we demonstrate that range schedules are superior because not only do they limit the workforce fluctuations from one production cycle to the next, but they also do so with a minor increase in the total workforce size. We extend our results to the m‐station system and develop heuristic algorithms. We find that these heuristics work poorly for min range (R), which indicates that special structural properties of the m‐station problem need to be identified before we can develop efficient algorithms. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 577–590, 2016     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于Zernike多项式拟合的自由曲面车削误差补偿技术

慢刀伺服车削技术是一种特殊的创成加工方法,采用C轴、X轴、Z轴联动的方式在极坐标或圆柱坐标内可车削加工自由曲面光学元件。但是由于各种误差因素的影响,使用慢刀伺服技术仅加工一次获得的光学元件可能不满足精度指标。为此需要研究能够进一步提升慢刀伺服车削加工精度的误差补偿技术。Zernike多项式是面形分析与光学分析之间的理想接口工具,因此本文使用Zernike多项式拟合的方法处理慢刀伺服车削加工的误差,并根据慢刀伺服加工技术的特点,建立慢刀伺服车削加工的误差补偿算法。实验结果表明,基于Zernike多项式拟合的慢刀伺服车削加工误差补偿技术可有效地针对加工中产生的特定误差进行补偿,从而提高自由曲面车削加工精度。     

基于One-port模式的测试点选取问题

在故障诊断过程中 ,每个测试点检测故障所需的时间可能不同。对于每个测试点一次检测所有可检测故障点的问题已经获得解决。对于每个测试点一次只能检测一个故障点 ,分两种情况加以讨论。若要求检测时间之和最小 ,给出了最优算法 ;若要求最大检测时间最小 ,证明了其是NP完全问题 ,并给出近似算法。最后给出一个实例对算法加以说明     

基于记忆有理函数的功率放大器行为模型

针对功率放大器的非线性特性及记忆效应,提出了一种基于记忆有理函数的功放行为模型。在传统记忆多项式模型和无记忆有理函数模型基础上,构建记忆有理函数模型,并利用共轭梯度法辨识模型系数,同时比较不同记忆深度和不同非线性阶数下的归一化均方误差,获取最佳记忆深度和非线性阶数。采用多载波的WCDMA信号和MRF6S21140H功放来验证模型的有效性,并与记忆多项式模型、无记忆有理函数模型进行了比较。结果表明,记忆有理函数模型在减少系数数目的同时具有更好的逼近精度。     

数据处理的实用方法和算法

通过对正交多项式的构造和逼近准则的研究,得到了一类数据处理问题的一种较理想的逼近准则和算法。理论分析和模拟计算表明,用本文方法处理这类问题有较高的拟合精度并容易计算。     

一类高次多项式系统极限环讨论及其应用

本文讨论了一类高次多项式系统极限环的存在唯一性,分析了系统的分枝,解决了系统的极限环的个数和分布问题,应用所得的结果,推广并改进了前人的结果。     

矩阵多项式aA+bI

本文讨论了矩阵A满足f(A)=0时一次矩阵多项式aB+bI可逆的条件,并给出了来(aA+bI)-1的一般方法。     

一类微分多项式的值分布

讨论了微分多项式fnP(f)(n≥2)之导数的Picard例外集问题,在Picard例外集的意义之下推广了Anderson等人的结果。     

Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.